منابع مشابه
A modular integer GCD algorithm
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U , V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC ’93: International Symposium on Symbolic and Algebr...
متن کاملGCD-Free Algorithms for Computing Modular Inverses
This paper describes new algorithms for computing a modular inverse e−1 mod f given coprime integers e and f . Contrary to previously reported methods, we neither rely on the extended Euclidean algorithm, nor impose conditions on e or f . The main application of our gcd-free technique is the computation of an RSA private key in both standard and CRT modes based on simple modular arithmetic oper...
متن کاملGCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation
A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The algorithm is based on evaluation at a single large integer value (for each variable), integer GCD computation, and a single-point interpolation scheme. Timing comparisons show that this algorithm is very efficient for most univariate problems and it is also the algorithm of choice for many problems...
متن کاملAlgebraic Factorization and GCD Computation
This chapter describes several algorithms for factorization and GCD computation of polynomials over algebraic extension fields. These algorithms are common in using the characteristic set method introduced in the previous chapters. Some performance comparisons between these algorithms are reported. Applications include geometry theorem proving, irreducible decomposition of algebraic variaities,...
متن کاملA New Algorithm and Refined Bounds for Extended Gcd Computation
Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides reened bounds on the size of the multipliers obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2004
ISSN: 0377-0427
DOI: 10.1016/j.cam.2003.08.014